A relaxed SCA approach for calibrating low rank correlation matrix problem
نویسندگان
چکیده
منابع مشابه
A Majorized Penalty Approach for Calibrating Rank Constrained Correlation Matrix Problems
In this paper, we aim at finding a nearest correlation matrix to a given symmetric matrix, measured by the componentwise weighted Frobenius norm, with a prescribed rank and bound constraints on its correlations. This is in general a non-convex and difficult problem due to the presence of the rank constraint. To deal with this difficulty, we first consider a penalized version of this problem and...
متن کاملRelaxed Leverage Sampling for Low-rank Matrix Completion
randomly sampled entries, thus matching the lower bound on the required number of entries (in terms of degrees of freedom), with an additional factor of O(log(m + n)). The above bound on sample size is achieved if each entry is observed according to probabilities proportional to the sum of corresponding row and column leverage scores, minus their product (see (4)). We show that this relaxation ...
متن کاملGreedy Approach for Low-Rank Matrix Recovery
We describe the Simple Greedy Matrix Completion Algorithm providing an efficient method for restoration of low-rank matrices from incomplete corrupted entries. We provide numerical evidences that, even in the simplest implementation, the greedy approach may increase the recovery capability of existing algorithms significantly.
متن کاملDecomposition Approach for Low-rank Matrix Completion
In this paper, we describe a low-rank matrix completion method based on matrix decomposition. An incomplete matrix is decomposed into submatrices which are filled with a proposed trimming step and then are recombined to form a low-rank completed matrix. The divide-and-conquer approach can significantly reduce computation complexity and storage requirement. Moreover, the proposed decomposition m...
متن کاملA Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
Based on the well-known result that the sum of the largest eigenvalues of a symmetric matrix can be represented as a semidefinite programming problem (SDP), we formulate the nearest low-rank correlation matrix problem as a nonconvex SDP and propose a numerical method that solves a sequence of least-square problems. Each of the least-square problems can be solved by a specifically designed semis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2015
ISSN: 1674-7216
DOI: 10.1360/n012013-00136